Characterizing and Computing the Set of Nash Equilibria via Vector Optimization

Computing Nash Equilibria through Particle Swarm Optimization

This paper considers the application of a novel optimization method, namely Particle Swarm Optimization, to compute Nash equilibria. The problem of computing equilibria is formed as one of detecting the global minimizers of a real-valued, nonnegative, function. To detect more than one global minimizers of the function at a single run of the algorithm and address effectively the problem of local...

Nash equilibria set computing in finite extended games

The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A method for NES computing is studied. Mathematics Subject Classification 2000: 91A05, 91A06, 91A10, 91A44, 90C05, 90C31, 90C90.

Computing Nash Equilibria of Action-Graph Games via Support Enumeration

The support-enumeration method (SEM) for computation of Nash equilibrium has been shown to achieve state-of-the-art empirical performance on normal-form games. Action-graph games (AGGs) are exponentially smaller than the normal form on many important classes of games. We show how SEM can be extended to the AGG representation, yielding an exponential improvement in worst-case runtime. Empiricall...

Computing Pure Nash Equilibria via Markov Random Fields

In this paper we present a novel generic mapping between Graphical Games and Markov Random Fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Thus, the problem of deciding whether a graphical game has a pure Nash equilibrium, a well-known intractable problem, can be attacked by well-established algorithms such as Belief Propagation, Junction T...

Quantum Nash Equilibria and Quantum Computing